hypercube graph造句

例句与造句

1. The only hypercube graph that is a cubic graph is the cubical graph.
2. Published in 1963, it is cospectral to the hypercube graph Q 4.
3. The simplest asymptotic family of examples of distance-transitive graphs is the Hypercube graphs.
4. It is isomorphic to the 16-vertex hypercube graph " Q " 4.
5. The hypercube graph provides a lower bound on the number of unit distances proportional to n \ log n.
6. It's difficult to find hypercube graph in a sentence. 用hypercube graph造句挺难的
7. Hypercube graphs should not be confused with cubic graphs, which are graphs that have exactly three edges touching each vertex.
8. More generally the Cartesian product of copies of a complete graph is called a Hamming graph; the hypercube graphs are examples of Hamming graphs.
9. The simplex graph of a complete graph is a hypercube graph, and the simplex graph of a cycle graph of length four or more is a gear graph.
10. It can be obtained by connecting an apex vertex to each of the degree-three vertices of a rhombic dodecahedron, or by merging two diametrally opposed vertices of a four-dimensional hypercube graph.
11. The achromatic number of an " n "-dimensional hypercube graph is known to be proportional to \ sqrt { n2 ^ n }, but the constant of proportionality is not known precisely.
12. In graph theory, a "'folded cube graph "'is an undirected graph formed from a hypercube graph by adding to it a perfect matching that connects " opposite " pairs of hypercube vertices.
13. The metric space of length-" n " binary strings, with the Hamming distance, is known as the " Hamming cube "; it is equivalent as a metric space to the set of distances between vertices in a hypercube graph.
14. The hypercube graph may also be constructed by creating a vertex for each subset of an-element set, with two vertices adjacent when their subsets differ in a single element, or by creating a vertex for each-digit binary number, with two vertices adjacent when their binary representations differ in a single digit.
15. A hypercube graph, in which the vertices correspond to all possible " k "-bit bitvectors and in which two vertices are adjacent when the corresponding bitvectors differ in only a single bit, is a special case of a " k "-dimensional grid graph and is therefore a median graph.
16. Non-cubic symmetric graphs include cycle graphs ( of degree 2 ), complete graphs ( of degree 4 or more when there are 5 or more vertices ), hypercube graphs ( of degree 4 or more when there are 16 or more vertices ), and the graphs formed by the vertices and edges of the octahedron, icosahedron, cuboctahedron, and icosidodecahedron.